A general model of preference aggregation
نویسنده
چکیده
The classical way of modelling the preferences of a Decision Maker, consists in assuming the existence of a value function u such that an alternative a is at least as good as an alternative b (a b) if and only if u(a) ≥ u(b). This leads to a model of preference in which is complete and transitive. Using such a preference model to establish a recommendation in a decision-aid study is straightforward and the main task of the Analyst is to assess u. In a multicriteria/multiattribute (we will use these terms interchangeably in this paper) context, each alternative a is usually seen as a vector g(a) = (g1(a), . . . , gn(a)) of evaluations of a w.r.t n points of view. Under some well-known conditions, u can be obtained in an additive manner, i.e. there are functions ui such that
منابع مشابه
UNCERTAINTY DATA CREATING INTERVAL-VALUED FUZZY RELATION IN DECISION MAKING MODEL WITH GENERAL PREFERENCE STRUCTURE
The paper introduces a new approach to preference structure, where from a weak preference relation derive the following relations:strict preference, indifference and incomparability, which by aggregations and negations are created and examined. We decomposing a preference relation into a strict preference, anindifference, and an incomparability relation.This approach allows one to quantify diff...
متن کاملProjects performance evaluation model based on Choquet Integral
In most of the multi–criteria decision–analysis (MCDA) problems in which the Choquet integral is used as aggregation function, the coefficients of Choquet integral (capacity) are not known in advance. Actually, they could be calculated by capacity definition methods. In these methods, the preference information of decision maker (DM) is used to constitute a possible solution space. ...
متن کاملArrow's theorem in judgment aggregation
In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue the opposite. After proving a general impossibility result on judgment aggregation, we construct an embedding of preference aggregation into judgment aggr...
متن کاملNew learning methods for supervised and unsupervised preference aggregation
In this paper we present a general treatment of the preference aggregation problem, in which multiple preferences over objects must be combined into a single consensus ranking. We consider two instances of this problem: unsupervised aggregation where no information about a target ranking is available, and supervised aggregation where ground truth preferences are provided. For each problem class...
متن کاملPreference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness
Voting theory provides useful insights for multiagent preference aggregation. However, the standard setting assumes totally ordered preferences, as well as a ballot language that coincides with the preference language. In typical AI scenarios, these assumptions do not hold: certain alternatives may be incomparable for some agents, and others may have their preferences encoded in a format that i...
متن کاملA COGNITIVE STYLE AND AGGREGATION OPERATOR MODEL: A LINGUISTIC APPROACH FOR CLASSIFICATION AND SELECTION OF THE AGGREGATION OPERATORS
Aggregation operators (AOs) have been studied by many schol- ars. As many AOs are proposed, there is still lacking approach to classify the categories of AO, and to select the appropriate AO within the AO candidates. In this research, each AO can be regarded as a cognitive style or individual dierence. A Cognitive Style and Aggregation Operator (CSAO) model is pro- posed to analyze the mapping ...
متن کامل